A Solution to the Animal Problem
نویسنده
چکیده
Let A be an animal. We consider magnifications of A in x-, y-, or z-direction. But this is not always possible because there may be voxels that block the magnification. To overcome this difficulty, we consider an AD-movement. This is performed by considering the magnification in two directions (e.g., y-direction and z-direction) such that any series of blocking voxels never forms a cycle. If a magnification is possible for two directions then it is also possible for the third direction. After all undilatable voxels have been erased, we can apply a previously shown result for showing that the animal problem is positively solvable. This paper is a continuation of [4]. Let B be a well-composed picture [3] that does not contain any cavity or any tunnel. Is B SD-equivalent (i.e., equivalent by repeated simple deformations) to a single voxel? This problem was named B-problem by the late Azriel Rosenfeld. In [4], we have given a positive solution to this problem. The animal problem proposed by Janos Pach was the question whether every animal can be reduced to a single unit cube by a finite sequence of moves, each consisting of either adding or deleting a cube provided the result is an animal again at each move. Azriel Rosenfeld called this problem the A-problem. In this animal problem, the deformation is not based on SD but must preserve animality of the picture at each step. This means that the B-problem is weaker than the A-problem. In this paper, we give a positive solution to the animal problem. We assume that readers are familiar with basic definitions in digital topology, such as provided in [1, 2], and, in particular, with the discussion in [4]. An animal is defined as a topological 3-ball in R, consisting of unit cubes (i.e., a subcomplex in the 3D grid cell space). In accordance with terms of digital topology, hereafter, we call a unit cube also a voxel. Let A be an animal consisting of black voxels (black means that a unit cube is present, i.e., in a given “object”) and p be a black voxel. 1 Professor emeritus at Hiroshima University, Japan; email: [email protected]
منابع مشابه
Animal Suffering: A Moorean Response to a Problem of Evil
In this paper, I propose a new response to a particular instance of the problem of evil: the problem of animal suffering. My solution, in brief, is that the rational theist may argue, justifiably, that an omnipotent, omniscient, omnibenevolent God would not allow gratuitous animal suffering to occur, and, therefore, all instances of animal suffering that are encountered are not instanc...
متن کاملHölder continuity of solution maps to a parametric weak vector equilibrium problem
In this paper, by using a new concept of strong convexity, we obtain sufficient conditions for Holder continuity of the solution mapping for a parametric weak vector equilibrium problem in the case where the solution mapping is a general set-valued one. Without strong monotonicity assumptions, the Holder continuity for solution maps to parametric weak vector optimization problems is discussed.
متن کاملOptimal Solution in a Constrained Distribution System
We develop a method to obtain an optimal solution for a constrained distribution system with several items and multi-retailers. The objective is to determine the procurement frequency as well as the joint shipment interval for each retailer in order to minimize the total costs. The proposed method is applicable to both nested and non-nested policies and ends up with an optimal solution. To solv...
متن کاملA Hybrid Solution Approach Based on Benders Decomposition and Meta-Heuristics to Solve Supply Chain Network Design Problem
Supply Chain Network Design (SCND) is a strategic supply chain management problem that determines its configuration. This mainly focuses on the facilities location, capacity sizing, technology selection, supplier selection, transportation, allocation of production and distribution facilities to the market, and so on. Although the optimal solution of the SCND problem leads to a significant reduc...
متن کاملAn Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملAPPLICABILITY OF THE WELL OPERATED CONDITIONS FOR THE SOLUTION OF MIXED PROBLEM ATTRIBUTED TO SCHR?DINGER EQUATION
As a sequel of the recent works, we would like to discuss another stage for the solution of the mixed problem which considers the concepts of well operated conditions applicable to the solution of mixed problem, i.e. the existence and uniqueness of the solution must always conformable with some assumptions.
متن کامل